10

The tree center problems and the relationship with the bottleneck knapsack problems

Year:
1997
Language:
english
File:
PDF, 57 KB
english, 1997
12

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

Year:
2000
Language:
english
File:
PDF, 454 KB
english, 2000
13

A Linear Time Algorithm for Finding ak-Tree Core

Year:
1997
Language:
english
File:
PDF, 173 KB
english, 1997
15

Quadratic M-convex and L-convex functions

Year:
2004
Language:
english
File:
PDF, 308 KB
english, 2004
16

Substitutes and complements in network flows viewed as discrete convexity

Year:
2005
Language:
english
File:
PDF, 196 KB
english, 2005
18

Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization

Year:
2003
Language:
english
File:
PDF, 298 KB
english, 2003
20

A constructive proof for the induction of M-convex functions through networks

Year:
1998
Language:
english
File:
PDF, 414 KB
english, 1998
21

Minimization of an M-convex function

Year:
1998
Language:
english
File:
PDF, 343 KB
english, 1998
34

The MA-ordering max-flow algorithm is not strongly polynomial for directed networks

Year:
2004
Language:
english
File:
PDF, 188 KB
english, 2004
46

Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra

Year:
2012
Language:
english
File:
PDF, 400 KB
english, 2012
47

Matroid rank functions and discrete concavity

Year:
2012
Language:
english
File:
PDF, 190 KB
english, 2012